منابع مشابه
Faster Algorithms for Computing Distances between One-Dimensional Point Sets
Let S and T be two finite sets of points on the real line with |S| + |T | = n and |S| > |T |. We consider two distance measures between S and T that have applications in music information retrieval and computational biology: the surjection distance and the link distance. The former is called the restriction scaffold assignment problem in computational biology, and assigns each point of S to a p...
متن کاملAn Efficient One Dimensional Parabolic Equation Solver using Parallel Computing
This paper will discuss the heat equation or as known as parabolic equation by Jacobi, Gauss Seidel and Alternating Direct Implicit (ADI) methods with the implementation of parallel computing on it. The numerical method is emphasized as platform to discretize the one dimensional heat equation. The result of three types of numerical methods will be presented graphically. The parallel algorithm i...
متن کاملComputing One-Dimensional Global Manifolds of Poincaré Maps by Continuation
We present an algorithm to compute one-dimensional stable and unstable manifolds of saddle periodic orbits in a Poincaré section. The computation is set up as a boundary value problem by restricting the beginning and end points of orbit segments to the section. Starting from the periodic orbit itself, we use collocation routines from AUTO to continue the solutions of the boundary value problem ...
متن کاملNeural Computing on a One Dimensional SIMD Array
Parallel processors offer a very attractive mechanism for the implementation of large neural networks. Problems in the usage of parallel processing in neural computing involve the difficulty of handling the large amount of global communication between processing units and the storage of weights for each of the neural processor connections. This paper wi l l discuss how massive parallelism in th...
متن کاملComputing the entropy of one-dimensional decidable subshifts
We characterise the difficulty of computing topological entropy of one-dimensional subshifts under various dynamical restrictions. Entropy is known to be computable from above for general one-dimensional subshifts, and the aim of the article is to distinguish under which dynamical properties it becomes computable. The considered properties are minimality, unique ergodicity, and various forms of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2019
ISSN: 2469-9950,2469-9969
DOI: 10.1103/physrevb.99.085408